A Shared Memory Parallel Implementation of Block-Circulant Preconditioners
نویسندگان
چکیده
The parallel numerical solution of large scale elliptic boundary value problems is discussed. We analyze the parallel complexity of two block-circulant preconditioners when the conjugate gradient method is used to solve the sparse linear systems arising from such problems. A simple general model of the parallel performance is applied to the considered shared memory parallel architecture. Estimates for the parallel times, the speed-up and the parallel efficiency are derived. The numerical tests have been executed on SGI PC 8 000 and SGI PC 10 000 as well as on Sun Ultra-Enterprise 168 MHz and 250 MHz computers.
منابع مشابه
Block {ω}-circulant preconditioners for the systems of differential equations
The numerical solution of large and sparse nonsymmetric linear systems of algebraic equations is usually the most time consuming part of time-step integrators for differential equations based on implicit formulas. Preconditioned Krylov subspace methods using Strang block circulant preconditioners have been employed to solve such linear systems. However, it has been observed that these block cir...
متن کاملParallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic problems have good numerical properties and a potential for high parallel efficiency. In this note parallel performance of a circulant block-factorization based preconditioner applied to a 3D model problem is investigated...
متن کاملIncomplete Inverse Preconditioners
Incomplete LU factorization is a valuable preconditioning approach for sparse iterative solvers. An “ideal” but inefficient preconditioner for the iterative solution of Ax = b is A−1 itself. This paper describes a preconditioner based on sparse approximations to partitioned representations of A−1, in addition to the results of implementation of the proposed method in a shared memory parallel en...
متن کاملBlock Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in hypre and PETSc
We describe our software package Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) publicly released recently. BLOPEX is available as a stand-alone serial library, as an external package to PETSc (“Portable, Extensible Toolkit for Scientific Computation”, a general purpose suite of tools for the scalable solution of partial differential equations and related problems developed by...
متن کاملBenchmarking Performance of Parallel Computers Using a 2d Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D elliptic problems have very good numerical properties and a potential for good parallel efficiency. The aim of the presentation is to summarize and compare their parallel performance across a number of modern parallel computers: SGI Pow...
متن کامل